Merging Belief Bases Represented by Logic Programs

نویسندگان

  • Julien Hué
  • Odile Papini
  • Eric Würbel
چکیده

This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic merging operators described in the framework of propositional logic. The study of these operators leads to a new definition of the consequence relation between logic programs which is based on the logic of Hereand-There brought by Turner. Moreover, the specificity of the non-monotonic framework given by logic programming with stable model semantics allows for describing a weakened version of the merging operation. Once the operators are defined, their behaviour with respect to the Konieczny and Pino-Perez postulates for merging are examined and discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Declarative Belief Set Merging Using Merging Plans

We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals. The framework is designed generically for flexible deployment to a range of applications, and allows to specify complex merging tasks in tree-structured merging plans, whose leaves are the possible belief sets of the knowledge bases that are proc...

متن کامل

Encoding Information Fusion in Possibilistic Logic: A General Framework for Rational Syntactic Merging

The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, expert opinion pooling, etc. Recently, several approaches have been proposed to merge classical propositional bases, or sets of (non-prioritized) goals. These approaches are in general semantically defined. Like in belief ...

متن کامل

Impossibility in Belief Merging

With the aim of studying social properties of belief merging and having a better understanding of impossibility, we extend in three ways the framework of logic-based merging introduced by Konieczny and Pino Pérez. First, at the level of representation of the information, we pass from belief bases to complex epistemic states. Second, the profiles are represented as functions of finite societies ...

متن کامل

Belief Merging Using Normal Forms

Belief merging aims to conciliate multiple possibly inconsistent belief bases into a consistent common belief base. To handle inconsistency some operators have been proposed. Most of them do not consider inconsistent bases. PS-Merge is an alternative method of merging that uses the notion of Partial Satisfiability and allows us to take into account inconsistent bases. PS-Merge needs the bases r...

متن کامل

A consistency-based framework for merging knowledge bases

We present a framework for expressing various merging operators for belief sets. This framework generalises our earlier work on consistency-based belief revision and contraction. Two primary merging operators are identified: in the first approach, belief sources are consistently combined so that the result of merging knowledge bases K1, . . . ,Kn is a maximal consistent (if possible) set of for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009